package leetcode;

/**
 * 分割等和子集
 * 01背包问题
 */
public class lc_416 {
    public static void main(String[] args) {
        System.out.println(canPartition(new int[]{3,3,3,4,5}));
    }
    public static boolean canPartition(int[] nums) {
        int sum = 0;
        for (int n: nums) {
            sum += n;
        }
        if(sum % 2 != 0)
            return false;
        int target = sum / 2;
        int[] dp = new int[target + 1];
        for (int i = 0; i < nums.length; i++) {
            for (int j = target; j >= nums[i] ; j--) {
                dp[j] = Math.max(dp[j], dp[j - nums[i]] + nums[i]);
            }
        }
        return dp[target] == target;
    }
}
